Extensions of Answer Set Programming: Declarative Heuristics, Preferences and Online Planning

The goal of this thesis is to extend Answer Set Programming (ASP) with declarative heuristics, preferences, and online planning capabilities. For declarative heuristics, the thesis presents a general declarative approach for incorporating domain-specific heuristics into ASP solving by means of logic programming rules. For preferences, the approach developed in my thesis and the resulting asprin system provide a general and flexible framework for quantitative and qualitative preferences in ASP. For online planning, the goal of my thesis is to integrate different approaches to online planning with incomplete information in a unified ASP approach.